Communication-optimal eventually perfect failure detection in partially synchronous systems

نویسندگان

  • Alberto Lafuente
  • Mikel Larrea
  • Iratxe Soraluze Arriola
  • Roberto Cortiñas
چکیده

Article history: Received 11 March 2009 Received in revised form 18 July 2013 Accepted 19 May 2014 Available online 2 July 2014

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implementing the Weakest Failure Detector for Solving Consensus

The concept of unreliable failure detector was introduced by Chandra and Toueg as a mechanism that provides information about process failures. This mechanism has been used to solve several agreement problems, like Consensus. In this paper, algorithms that implement failure detectors in partially synchronous systems are presented. First two simple algorithms of the weakest class to solve Consen...

متن کامل

Implementing Diamond P with Bounded Messages on a Network of ADD Channels

We present an implementation of the eventually perfect failure detector (♦P ) from the original hierarchy of the Chandra-Toueg [4] oracles on an arbitrary partitionable network composed of unreliable channels that can lose and reorder messages. Prior implementations of ♦P have assumed different partially synchronous models ranging from bounded point-to-point message delay and reliable communica...

متن کامل

Designing Efficient Algorithms for the Eventually Perfect Failure Detector Class

This paper focuses on the design of unreliable failure detectors of the Eventually Perfect class (3P) in crash-prone partially synchronous systems. We adopt a monitoring mechanism based on heartbeats over a logical ring arrangement of processes as the common design feature. This provides good communication efficiency, a performance parameter which refers to the number of links that carry messag...

متن کامل

Crash-Quiescent Failure Detection

A distributed algorithm is crash quiescent if it eventually stops sending messages to crashed processes. An algorithm can be made crash quiescent by providing it with either a crash notification service or a reliable communication service. Both services can be implemented in practical environments with failure detectors. Therefore, crash-quiescent failure detection is fundamental to system-wide...

متن کامل

Failure Detection with Booting in Partially Synchronous Systems

Unreliable failure detectors are a well known means to enrich asynchronous distributed systems with time-free semantics that allow to solve consensus in the presence of crash failures. Implementing unreliable failure detectors requires a system that provides some synchrony, typically an upper bound on end-to-end message delays. Recently, we introduced an implementation of the perfect failure de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comput. Syst. Sci.

دوره 81  شماره 

صفحات  -

تاریخ انتشار 2015